Analysis of decentralized multi‐product pull systems with lost sales

We study a pull‐type, flexible, multi‐product, and multi‐stage production/inventory system with decentralized two‐card kanban control policies. Each stage involves a processor and two buffers with finite target levels. Production stages, arranged in series, can process several product types one at a time. Transportation of semi‐finished parts from one stage to another is performed in fixed lot sizes. The exact analysis is mathematically intractable even for smaller systems. We present a robust approximation algorithm to model two‐card kanban systems with batch transfers under arbitrary complexity. The algorithm uses phase‐type modeling to find effective processing times and busy period analysis to identify delays among product types in resource contention. Our algorithm reduces the effort required for estimating performance measures by a considerable margin and resolves the state–space explosion problem of analytical approaches. Using this analytical tool, we present new findings for a better understanding of some tactical and operational issues. We show that flow of material in small procurement sizes smoothes flow of information within the system, but also necessitates more frequent shipments between stages, raising the risk of late delivery. Balancing the risk of information delays vis‐à‐vis shipment delays is critical for the success of two‐card kanban systems. Although product variety causes time wasted in setup operations, it also facilitates relatively short production cycles enabling processors to switch from one product type to another more rapidly. The latter point is crucial especially in high‐demand environments. Increasing production line size prevents quick response to customer demand, but it may improve system performance if the vendor lead‐time is long or subject to high variation. Finally, variability in transportation and processing times causes the most damage if it arises at stages closer to the customer. © 2007 Wiley Periodicals, Inc. Naval Research Logistics, 2007     

Managing components for assemble‐to‐order products with lead‐time‐dependent pricing: The full‐shipment model

We study a component inventory planning problem in an assemble‐to‐order environment faced by many contract manufacturers in which both quick delivery and efficient management of component inventory are crucial for the manufacturers to achieve profitability in a highly competitive market. Extending a recent study in a similar problem setting by the same authors, we analyze an optimization model for determining the optimal component stocking decision for a contract manufacturer facing an uncertain future demand, where product price depends on the delivery times. In contrast to our earlier work, this paper considers the situation where the contract manufacturer needs to deliver the full order quantity in one single shipment. This delivery requirement is appropriate for many industries, such as the garment and toy industries, where the economies of scale in transportation is essential. We develop efficient solution procedures for solving this optimization problem. We use our model results to illustrate how the different model parameters affect the optimal solution. We also compare the results under this full‐shipment model with those from our earlier work that allows for multiple partial shipments. © 2007 Wiley Periodicals, Inc. Naval Research Logistics, 2007     

Puzzle‐based storage systems

We introduce and develop models for a physical goods storage system based on the 15‐puzzle, a classic children's game in which 15 numbered tiles slide within a 4 × 4 grid. The objective of the game is to arrange the tiles in numerical sequence, starting from a random arrangement. For our purposes, the tiles represent totes, pallets, or even containers that must be stored very densely, and the objective is to maneuver items to an input–output point for retrieval or processing. We develop analytical results for storage configurations having a single empty location (as in the game) and experimental results for configurations with multiple empty locations. Designs with many empty locations can be made to form aisles, allowing us to compare puzzle‐based designs with traditional aisle‐based designs found in warehousing systems. © 2007 Wiley Periodicals, Inc. Naval Research Logistics, 2007     

基于Multi-agent临床诊断支持系统的设计

根据临床诊断支持信息环境的特点,结合Agent技术,设计了一套基于Multi-agent的临床诊断支持系统(CDSS)。该系统具有异构性、分布性、并行性和可扩展性,能适应CDSS的要求,有效地提高CDSS的性能。     

基于冗余的复杂体系动态适应性结构设计研究

针对复杂体系动态适应性研究所存在的问题,提出了复杂体系冗余概念和基于冗余的复杂体系动态适应性结构设计思想,讨论了基于冗余的复杂体系动态博弈设计过程及体系结构;在此基础上,根据复杂体系使命目标的执行特点及体系本身的结构特性,详细地阐述了复杂体系中的任务冗余、系统冗余和结构冗余三种冗余类型,并从冗余切换方式、冗余具体内容和冗余表现性质三个方面论述了复杂体系中各种冗余所组成的冗余体系,指出冗余体系是复杂体系适应环境的一种策略,也是复杂体系不断演化的需要和结果,并且能够为复杂体系动态适应性结构的构建及其效能评估和复杂体系的优化及改进等研究提供一定的理论指导。     

天基支援下区域反导组网作战链路规划

天基信息支援下区域反导组网作战各系统实现互连、互通、互操作的关键是战术信息分发系统,而该系统中存在着多种类型的数据链路,这些链路之间又存在着各种约束条件,因此科学合理的对这些链路进行规划是系统实现的重要工作之一.建立并提出了天基信息支援下区域反导组网作战战术信息分发系统数据链路的规划模型和一种新的解算方法,为该系统数据链路的规划提供了理论依据.     

作战飞机信息通信方法

通过对作战飞机信息通信方法的研究,指出了作战飞机进行信息通信的两种方法-语音通信和数码通信;并分析了数码通信的硬件结构和机载通信的硬件设备的工作原理.探讨了未来的网络中心战中基于网络化数码通信的方法,为未来空战基于网络中心战技术的实际应用奠定基础.     

基于轮廓特征的空间目标识别算法

高分辨力单脉冲雷达通过对三个通道回波成像可以获取各个散射中心的方位角和俯仰角,结合距离信息就可以得到各个散射中心在垂直于雷达天线轴的平面上的投影,形成方位-俯仰二维像.由于卫星的尺寸通常大于碎片的尺寸,因此卫星的方位-俯仰二维像的轮廓面积较大.提出了基于轮廓特征的空间目标识别算法,首先通过高分辨力单脉冲雷达对目标进行方位-俯仰二维像成像,然后从方位-俯仰二维像中提取目标轮廓,最后根据轮廓面积特征对卫星和碎片进行识别.经过计算机仿真实验,该算法取得了比较好的识别效果.     

机载多传感器角度融合跟踪结构与算法

未来战机的作战环境要求机载多传感器数据融合系统在仅有角度测量信息情况下仍须具有稳定的目标跟踪能力.对机载多传感器的角度融合跟踪系统的结构和算法进行了研究,分别给出了两个传感器同步测量时的集中式状态估计算法和异步测量时不损信息量的混合式状态估计算法,即顺序滤波方法,并对相应算法进行了仿真验证.     

自行火炮自动瞄准精度数据分析

通过自动瞄准精度的定义和测试方法简介,针对某自行火炮火控系统在自动瞄准精度测试中出现测量数据误差较大的现象,分析数据误差的原因,计算各种因素造成误差的大小,得出对自动瞄准精度影响最大的是车体姿态倾斜传感器误差、炮耳轴倾斜传感器的误差和炮耳轴与炮身轴线的不垂直度.鉴于此,自行火炮提出用火控软件的方法和工艺控制,减少自动瞄准误差和射击诸元装定误差,提高射击精度.